CONNECTEDNESS OF GRAPHS GENERATED BY A RANDOM d-PROCESS
نویسندگان
چکیده
Suppose that a graph process begins with n isolated vertices, to which edges are added randomly one by one so that the maximum degree of the induced graph is always at most d . In a previous article, the authors showed that as n → ∞, with probability tending to 1, the result of this process is a d-regular graph. This graph is shown to be connected with probability asymptotic to 1. 2000 Mathematics subject classification: primary 05C80, 60K99.
منابع مشابه
Mixing times for the interchange process
Consider the interchange process on a connected graph G = (V,E) on n vertices. I.e. shuffle a deck of cards by first placing one card at each vertex of G in a fixed order and then at each tick of the clock, picking an edge uniformly at random and switching the two cards at the end vertices of the edge with probability 1/2. Well known special cases are the random transpositions shuffle, where G ...
متن کاملConnectedness in Graph Limits
We define direct sums and a corresponding notion of connectedness for graph limits. Every graph limit has a unique decomposition as a direct sum of connected components. As is well-known, graph limits may be represented by symmetric functions on a probability space; there are natural definitions of direct sums and connectedness for such functions, and there is a perfect correspondence with the ...
متن کاملDisintegration, Yule Process and Random Graphs
In this paper we demonstrate that the disintegration process of radioactive atoms in the discrete time model has a natural interpretation in the theory of random graphs. Moreover, we reduce some problems in this area to disintegration processes with anomalies. For instance , we derive exact closed formull for the probabilities and the moments of the number of isolated vertices in Bernoulli grap...
متن کاملRandom graph models for wireless communication networks
This thesis concerns mathematical models of wireless communication networks, in particular ad-hoc networks and 802.11 WLANs. In ad-hoc mode each of these devices may function as a sender, a relay or a receiver. Each device may only communicate with other devices within its transmission range. We use graph models for the relationship between any two devices: a node stands for a device, and an ed...
متن کاملThe notions of closedness and D-connectedness in quantale-valued approach spaces
In this paper, we characterize local $T_{0}$ and $T_{1}$ quantale-valued gauge spaces, show how these concepts are related to each other and apply them to $mathcal{L}$-approach distance spaces and $mathcal{L}$-approach system spaces. Furthermore, we give the characterization of a closed point and $D$-connectedness in quantale-valued gauge spaces. Finally, we compare all these concepts to each o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001